Optimizing Bottom-Up Evaluation of Constraint Queries

نویسندگان

  • David B. Kemp
  • Peter J. Stuckey
چکیده

We consider a class of constraint logic programs including negation that can be executed bottom up without constraint solving, by replacing constraints with tests and assignments. We show how to optimize the bottom-up evaluation of queries for such programs using transformations based on analysis obtained using abstract interpretation. Although the paper concentrates on a class of eeciently executable programs the optimizations we describe are correct and applicable for arbitrary constraint programs. Our approach generalizes earlier work on constraint propagation.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Top-down Beats Bottom-up for Constraint Extensions of Datalog

This paper proposes an eecient method for evaluating queries over constraint databases. The method is based on a combination of top-down resolution with memoing and closed form bottom-up evaluation. In this way top-down evaluation terminates for all queries for which the bottom-up evaluation also terminates. The main advantage of the proposed method is the direct use of partially instantiated q...

متن کامل

Controlling the Search in Bottom - Up

Bottom-up evaluation of queries on deductive databases has many advantages over an evaluation scheme such as Prolog. It is sound and complete with respect to the declarative semantics of least Herbrand models for positive Horn clause programs. In particular, it is able to avoid innnite loops by detecting repeated (possibly cyclic) subgoals. Further, in many database applications , it is more ee...

متن کامل

Datalog Queries of Set Constraint Databases

Extension of the relational database model to represent complex data has been a focus of much research in recent years. At the same time, an alternative extension of the relational database model has proposed using constraint databases that finitely describe infinite relations. This paper attempts to combine these two divergent approaches. In particular a query language called Datalog with set ...

متن کامل

Optimization of bound disjunctive queries with constraints

This paper presents a technique for the optimization of bound queries over disjunctive deductive databases with constraints. The proposed approach is an extension of the wellknown Magic-Set technique and is well-suited for being integrated in current bottom-up (stable) model inference engines. More specifically, it is based on the exploitation of binding propagation techniques which reduce the ...

متن کامل

Linear Constraint Projection

In most of the existing linear CLP systems, a projection is employed for the answer presentation in order to eliminate the dead variables not occuring in the query. But projection is more than an ornament of the answer presentation. We have shown that there are planning problems that depend heavily on an early projection. While it is not clear how to integrate early projection in the presence o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Log. Program.

دوره 26  شماره 

صفحات  -

تاریخ انتشار 1996